mth roots of H-selfadjoint matrices
نویسندگان
چکیده
In this paper necessary and sufficient conditions are given for the existence of an H-selfadjoint mth root a matrix. A construction is such when it does exist.
منابع مشابه
VANISHING SUMS OF mTH ROOTS OF UNITY IN FINITE FIELDS
In an earlier work, the authors have determined all possible weights n for which there exists a vanishing sum ζ1 + · · · + ζn = 0 of m th roots of unity ζi in characteristic 0. In this paper, the same problem is studied in finite fields of characteristic p. For given m and p, results are obtained on integers n0 such that all integers n ≥ n0 are in the “weight set” Wp(m). The main result (1.3) i...
متن کاملLipschitz stability of canonical Jordan bases of H-selfadjoint matrices under structure-preserving perturbations
In this paper we study Jordan-structure-preserving perturbations of matrices selfadjoint in the indefinite inner product. The main result of the paper is Lipschitz stability of the corresponding similitude matrices. The result can be reformulated as Lipschitz stability, under small perturbations, of canonical Jordan bases (i.e., eigenvectors and generalized eigenvectors enjoying a certain flipp...
متن کاملOn the number of mth roots of permutations
Letm be a fixed positive integer. It is well-known that a permutation σ of {1, . . . , n}may have one, many, or nomth roots. In this article we provide an explicit expression and a generating function for the number of mth roots of σ. Let pm(n) be the probability that a random n-permutation has an mth root. We also include a proof of the fact that pm(jq) = pm(jq + 1) = · · · = pm(jq + (q − 1)),...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملRoots Multiplicity without Companion Matrices
We show a method for constructing a polynomial interpolating roots’ multiplicities of another polynomial, that does not use companion matrices. This leads to a modification to Guersenzvaig– Szechtman square-free decomposition algorithm that is more efficient both in theory and in practice. The problem of computing the square-free decomposition of a polynomial is well established in the realm of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2020.10.020